Approximating the hard square entropy constant with probabilistic methods
نویسندگان
چکیده
منابع مشابه
Approximating the Hard Square Entropy Constant with Probabilistic Methods
For any Z2 nearest neighbor shift of finite type X and any integer n ≥ 1, one can define the horizontal strip shift Hn to be the set of configurations on Z × {1, . . . , n} which do not contain any forbidden transitions for X. It is always the case that limn→∞ h (Hn) n = htop(X). In this paper, we use probabilistic methods from interacting particle systems to show that for the Z2 hard square sh...
متن کاملThe Hard Square Entropy Constant
There is model of gasses used in statistical physics called the hard sphere gas model. One of the common simplifications to this model is to assume that all of the gas molecules lie at grid points in a plane and only interact with their four grid-neighbors. The grid is taken to be rigid and square, hence the “hard square” portion of the name. R. J. Baxter, I. G. Enting, and S. K. Tsang wrote [2...
متن کاملApproximating the Stable Model Semantics is Hard
In this paper we investigate the complexity of problems concerned with approximating the stable model semantics. We show that under rather weak assumptions it is NP-hard to decide whether the size of a polynomially computable approximation is within a constant factor from the size of the intersection (union) of stable models of a program. We also show that unless P=NP, no approximation exists t...
متن کاملOn Approximating Hard Integrals with the Double-Exponential Formula
Approximating I#PART = ́ 1 0 ∏ n k=1 cos (xkπt) dt to within an accuracy of 2 −n where the input integers {xk} n k=1 are given in binary radix, is equivalent to counting the number of equal-sum partitions of the integers {xk} and is thus a #P problem. Similarly, integrating this function from zero to infinity and deciding whether the result is either zero or infinity is an NP-Complete problem. E...
متن کاملThe Complexity of Approximating the Entropy
We consider the problem of approximating the entropy of a discrete distribution under several different models of oracle access to the distribution. In the evaluation oracle model, the algorithm is given access to the explicit array of probabilities specifying the distribution. In this model, linear time in the size of the domain is both necessary and sufficient for approximating the entropy. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2012
ISSN: 0091-1798
DOI: 10.1214/11-aop681